Learning Kinematic Structure Correspondences Using Multi-Order Similarities
نویسندگان
چکیده
منابع مشابه
Structure from Constrained Motion Using Point Correspondences
Mobile objects are frequently confined to move on a ground surface which, locally at least, is approximately flat. Existing structure-from-motion (SFM) algorithms make no use of real-world motion constraints of this kind. In this paper we present a simple novel SFM algorithm whereby the above motion constraints can be conveniently incorporated into the constraint equations on the relative depth...
متن کاملObject tracking using affine structure for point correspondences
A new object tracking algorithm based on affine structure has been developed and it is shown that the performance is better than that of a Kalman filter based correlation tracker. The algorithm is fast, reliable, viewpoint invariant, and insensitive to occlusion and/or individual corner disappearance or reappearance. Detailed experimental analysis on a long real image sequence is also presented.
متن کاملLearning with Multiple Similarities Learning with Multiple Similarities
Title of dissertation: LEARNINGWITHMULTIPLE SIMILARITIES Abhishek Kumar, Doctor of Philosophy, 2013 Dissertation directed by: Professor Hal Daumé III Department of Computer Science The notion of similarities between data points is central to many classification and clustering algorithms. We often encounter situations when there are more than one set of pairwise similarity graphs between objects...
متن کاملMultitask Learning without Label Correspondences
We propose an algorithm to perform multitask learning where each task has potentially distinct label sets and label correspondences are not readily available. This is in contrast with existing methods which either assume that the label sets shared by different tasks are the same or that there exists a label mapping oracle. Our method directly maximizes the mutual information among the labels, a...
متن کاملLearning to Find Good Correspondences
We develop a deep architecture to learn to find good correspondences for wide-baseline stereo. Given a set of putative sparse matches and the camera intrinsics, we train our network in an end-to-end fashion to label the correspondences as inliers or outliers, while simultaneously using them to recover the relative pose, as encoded by the essential matrix. Our architecture is based on a multi-la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2018
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2017.2777486